Improved Colorization Algorithm Using Lp Norm Minimization
نویسندگان
چکیده
منابع مشابه
An improved algorithm for the L2 - Lp minimization problem
In this paper we consider a class of non-Lipschitz and non-convex minimization problems which generalize the L2 − Lp minimization problem. We propose an iterative algorithm that decides the next iteration based on the local convexity/concavity/sparsity of its current position. We show that our algorithm finds an -KKT point within O(log −1) iterations. The same result is also applied to the prob...
متن کاملStable Image Colorization Algorithm Based on the Mixed L0/L1 Norm Minimization
This paper proposes a colorization algorithm based on the mixed L0/L1 norm minimization. Authors have already proposed a colorization algorithm, however, it requires appropriate parameters, and its performance highly depends on these parameters. This paper introduces some heuristic and modifies the algorithm in order to reduce the dependence of parameters. Numerical examples show that the propo...
متن کاملFast and Simple Iterative Algorithm of Lp-Norm Minimization for Under-Determined Speech Separation
This paper presents an efficient algorithm to solve Lp-norm minimization problem for under-determined speech separation; that is, for the case that there are more sound sources than microphones. We employ an auxiliary function method in order to derive update rules under the assumption that the amplitude of each sound source follows generalized Gaussian distribution. Experiments reveal that our...
متن کاملA Nuclear Norm Minimization Algorithm with Application
In this paper we present a new algorithm to reconstruct prestack (5D) seismic data. If one considers seismic data at a given frequency and, for instance, in the x midpoint, y midpoint, offset and azimuth domain, the data volume can be represented via a 4th order tensor. Seismic data reconstruction can be posed as a tensor completion problem where it is assumed that the fully sampled data can be...
متن کاملControl Using Atomic Norm Minimization
It has been shown that the H2 distributed control problem subject to quadratically invariant delay constraints admits a finite dimensional solution. When these delay constraints are induced by a strongly connected communication graph, this problem can be solved by decomposing the controller into a centralized but delayed component, and a distributed finite impulse response component, the latter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Signal Processing
سال: 2015
ISSN: 1342-6230,1880-1013
DOI: 10.2299/jsp.19.155